Main Memory Evaluation of Monitoring Queries Over Moving Objects
نویسندگان
چکیده
منابع مشابه
In-Memory Evaluation of Continuous Range Queries on Moving Objects
In this paper we address the emerging problem of evaluating continuous range queries over collections of moving objects. Such queries form the basis for a large class of interesting queries e.g., moniroring a region of space to determine which objects (people, vehicles, etc.) enter or leave, and ensuring that the number of policemen in a stadium does nol drop below some threshold during a ball ...
متن کاملEvaluation of Content-Matched Range Monitoring Queries over Moving Objects in Mobile Computing Environments
A content-matched (CM) rangemonitoring query overmoving objects continually retrieves the moving objects (i) whose non-spatial attribute values are matched to given non-spatial query values; and (ii) that are currently located within a given spatial query range. In this paper, we propose a new query indexing structure, called the group-aware query region tree (GQR-tree) for efficient evaluation...
متن کاملMoving Range Queries over RFID Monitored Objects
As a promising technology for monitoring and tracing the product flows and human activities, Radio Frequency Identification (RFID) has received much attention within database community. Moving range query over RFID data streams is one of the most important spatio-temporal queries to support valuable information analysis. However, the uncertainty of the monitored object location challenges the q...
متن کاملProbabilistic Skyline Queries over Uncertain Moving Objects
Data uncertainty inherently exists in a large number of applications due to factors such as limitations of measuring equipments, update delay, and network bandwidth. Recently, modeling and querying uncertain data have attracted considerable attention from the database community. However, how to perform advanced analysis on uncertain data remains an interesting question. In this paper, we focus ...
متن کاملContinuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points in P and their closest medoid. Finding the optimal k medoids is NP hard, and existing algorithms aim at approximate answers, i.e., they compute medoids that achieve a small, yet not minimal, average distance. Similarl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed and Parallel Databases
سال: 2004
ISSN: 0926-8782
DOI: 10.1023/b:dapd.0000013068.25976.88